Informatics Publishing Limited

Chandni Upadhyaya ¹, Ved Vyas Dwivedi ², Trushit Upadhyaya ³

Affiliations
1 P.M. Patel Institute of Integrated, Anand, IN
2 Nobel Engineering College, Junagadh, IN
3 Electronics and Communication Engineering Department, Charotar University of Science and Technology, Changa, Gujarat, IN

Abstract

The dependency of human on electromagnetic wave is apparent, which is sole responsible for wireless communication. EM waves offer numerous advantages for mankind but gloomy effect is to be undoubtedly faced. The hazard of electromagnetic wave has been intensively studied across the globe on animal tissues to analyze and understand the effect of exposure of EM wave on humans. The paper addresses the EM Wave – Plant interaction through biochemical analysis. The cruelty of electromagnetic waves on plant tissue is presented through range of experimental analysis on medical plant.

Keywords

Biochemical Analysis, EM Waves, Harmful Effects, Spectrophotometric Estimation.

Full Text

     

Vivek Unadkat , Ved Vyas Dwivedi , Rachna Jani , Rohit Thanki

Abstract

The tapered slot antenna, such as Vivaldi, has been widely used due to its ultra-wideband, simple feed structure, and easy fabrication. However, the obtained radiation patterns show that conventional tapered slot antenna suffers from poor directivity in the lower part of band. To overcome this shortfall, corrugations were added on its sides. By comparing performances of the conventional and corrugated TSA it was demonstrated that by choosing a suitable corrugation pattern the directivity and beam efficiency can be improved. Our aim is to propose a wide band, higher gain Corrugated linearly tapered slot antenna (CLTSA) with relatively low cross-polarization levels and also to investigate how different patterns of corrugations will affect the radiation characteristic of linearly tapered slot antenna.

Keywords

Travelling Wave Antennas, Antenna Radiation Patterns, Corrugations, LTSA

Full Text

     

Dhaval R. Bhojani ¹, Ved Vyas Dwivedi ²

Affiliations
1 Shri Jagdishprasad Jhabarmal Tibrewal University, Rajasthan, IN
2 Noble Group of Institutes, Junagadh, Gujarat, IN

Abstract

As the latest era is of multimedia applications for internet, major file transfers on the internet are audio or video files. So the major bandwidth usage of internet connection of any user is by these types of files. To reduce the bandwidth requirement in transferring multimedia files is major challenge now a day. So for this, there must be compression algorithms which can reduce the size of these files. This paper introduces advancement in the video compression technology to improve the compression ratio, without losing much quality of the video. Here the method, we have introduced is much simpler to implement in the practical implementation that small amount of modification in the existing codec can give better results. Here we have implemented the encoder and decoder in the MATLAB platform. The input videos were in uncompressed ‘.avi’ format. The compressed video contains some degradation but has good perceptibility that can be easily visible.

Keywords

Adaptive Rood Pattern Search (ARPS), Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), Group of Pictures (GOP), Run Length Encoding (RLE).

Full Text

     

Ashish M. Kothari ¹, Ved Vyas Dwivedi ²

Affiliations
1 Department of Electronics & Communication, Atmiya Institute of Technology & Science, Rajkot, Gujarat, IN
2 Noble Group of Colleges, Junagadh, IN

Abstract

In this paper, we have suggested two different spatial domain method based on the correlation property for the digital video watermarking and used the same for embedding invisible watermarks behind the video. It is used for the copyright protection as well asproof of ownership. Here we used the characteristic of the spatial domain methods for the embedding of the binary watermark where depending on the watermark the pixel value is directly modified and at the receiver end the modification is reverted. In this paper we first extracted the frames from the video and then embedded thewatermark using a key and a pseudo random pattern generated using the key. At the receiver end we used correlation characteristics of the pixels for watermarking extraction. In this paper we have designed a threshold based and a comparison based correlation approaches and at the end of the paper we compared both methods based on different visual quality matrices.

Keywords

Digital Video Watermarking, Copyright Protection, Spatial Domain Watermarking, Threshold Based Correlation, Comparison Based Correlation.

Full Text

     

Nitesh M. Sureja ¹, Ved Vyas Dwivedi ², Sanjeev Kumar ³

Affiliations
1 NIMS Institute of Engineering and Technology, NIMS University, Jaipur, Rajasthan, IN
2 Noble Group of Institutions, Junagadh, Gujarat, IN
3 Department of Information Technology, NIMS Institute of Engineering and Technology, NIMS University, Jaipur, Rajasthan, IN

Abstract

The Memetic algorithms (MA) are computational models inspired by the Cultural Revolution. Robustness, scalability and simplicity are the advantages of Memetic algorithms. By looking at this strength of MA, they are very much suitable for solving some combinatorial optimization problems which falls in the category of NP-hard problems. In this paper, we propose MA based optimization model for Dynamic Traveling Salesman Problem (DTSP), to achieve overall higher system performance and better throughput.

During implementation, results are obtained with number of randomly generated Traveling Salesman Problem instances, measured in terms of required time, quality and path length. It has been observed that the proposed model works well in terms of quality and path length. As it uses Simulated Annealing, it is found little bit less effective in terms of time.

Keywords

Memetic Algorithms, Simulated Annealing, Dynamic Traveling Salesman Problem (DTSP), Optimization Problems.

Full Text

     

Nitesh M. Sureja ¹, Ved Vyas Dwivedi ², Sanjeev Kumar ³

Affiliations
1 NIMS Institute of Engineering and Technology, NIMS University, Jaipur, Rajasthan, IN
2 Noble Group of Institutions, Junagadh, Gujarat, IN
3 Department of Information Technology, NIMS Institute of Engineering and Technology, NIMS University, Jaipur, Rajasthan, IN

Abstract

Ant Colony Optimization (ACO) is a novel and competitive optimization method for numerous combinatorial optimization problems. It is already applied to various optimization problems. Normally it proved best in terms of solution quality, accuracy and other parameters. This paper presents an Elitist Ant System (EAS) which uses tuning in pheromone update process to improve the performance of the basic Ant System (AS) approach. Dynamic Traveling Salesman Problem is solved in this research with the various pheromone update strategy for finding the improvements in the results. The results obtained are empirically compared with the results obtained with the basic pheromone update strategy of Ant System.

Keywords

Ant Colony Optimization, ElitistAnt System, Dynamic Traveling Salesman Problem (DTSP), Optimization.

Full Text

     

Nitesh M. Sureja ¹, Ved Vyas Dwivedi ², Sanjeev Kumar ³

Affiliations
1 NIMS Institute of Engineering and Technology, Nims University, Jaipur, Rajasthan, IN
2 Noble Group of Institutions, Junagadh, Gujarat, IN
3 Department of Information Technology, NIMS Institute of Engineering and Technology, Nims University, Jaipur, Rajasthan, IN

Abstract

Cuckoo Search is a recently developed, novel and competitive Nature Inspired Optimization algorithm used for solving various linear and discrete combinatorial optimization problems. It is already applied to the problems like PCB Drilling, finding optimal features, optimizing the parameters of various classifiers including Neural Network, RBF, SVM parameters, finding optimizing cluster centers, job scheduling, find optimal path and many more in the different domains including industry, health sector, wireless sensor network, image processing and others. Due to its proven capacity in solution quality, accuracy and other parameters, in this paper we present a cuckoo search based model to solve Dynamic Traveling Salesman Problem. The results obtained are compared with the results obtained with the other models proposed for the same problem. Results obtained are very good in terms of all related parameters.

Keywords

Cuckoo Search Algorithm, Combinatorial Optimization, Dynamic Traveling Salesman Problem, Nature Inspired Algorithms, Random Walk.

Full Text

     

Nitesh M. Sureja ¹, Ved Vyas Dwivedi ²

Affiliations
1 NIMS University, Jaipur, Rajasthan, IN
2 Noble Group of Institutions, Junagadh, Gujarat, IN

Abstract

There are varieties of problems in various engineering branches which can’t be solved using traditional search techniques. These problems are known as NP hard problems. The problem which can’t be solved in a polynomial time is called a NP hard problem. This type of problem normally involved exhaustive searching in side it. Various Nature inspired techniques are developed and employed by the researchers to solve this kind of problems. Evolutionary algorithms (EAs) are one of them. These algorithms are known as optimization algorithms as they give very near optimal solution. In this paper, we investigate the ability of Evolutionary Algorithm (EA) by applying it to Dynamic Traveling Salesman Problem (DTSP). Dynamic Traveling Salesman Problem is a real world TSP where problem changes itself over the period of the time. It is very difficult to solve it by using traditional methods. We apply an optimization method, evolutionary algorithm to it and obtain the results. Experimental results indicate that EAs can overcome many problems encountered by traditional search techniques. The performance of EAs is compared to the results of traditional search techniques.

Keywords

Nature Inspired Algorithm, Evolutionary Algorithms, Optimization, Dynamic Traveling Salesman Problem.

Full Text

     

Kapil Raviya ¹, Ved Vyas Dwivedi ², Ashish Kothari ³, Gunvantsinh Gohil ⁴

Affiliations
1 College of Agricultural Engineering and Technology, Electronics Communication Engineering, Junagadh Agricultural University, Gujarat, IN
2 C. U. Shah University, Pro- Vice Chancellor, Wadhwan City, Gujarat, IN
3 Electronics Communication Engineering, Atmiya Institute of technology & Science, Gujarat technological university, Gujarat, IN
4 College of Agricultural Engineering and Technology, Junagadh Agricultural University, Gujarat, IN

Abstract

The researcher have suggested real time depth based on frequency domain hole filling. It get better quality of depth sequence generated by sensor. This method is capable to produce high feature depth video which can be quite useful in improving the performance of various applications of Microsoft Kinect such as obstacle detection and avoidance, facial tracking, gesture recognition, pose estimation and skeletal. For stereo matching approach images depth extraction is the hybrid (Combination of Morphological Operation) mathematical algorithm. There are few step like color conversion, block matching, guided filtering, minimum disparity assignment design, mathematical perimeter, zero depth assignment, combination of hole filling and permutation of morphological operator and last nonlinear spatial filtering. Our algorithm is produce smooth, reliable, noise less and efficient depth map. The evaluation parameter such as Structure Similarity Index Map (SSIM), Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) measure the results for proportional analysis.

Keywords

Depth, Disparity, Guided Filter, Kinect, Morphological Filter, Stereo Matching, Warp, Zero Depth, 3-Dimension.

Full Text

   

Nayankumar Patel ¹, Ved Vyas Dwivedi ², Ashish Kothari ³

Affiliations
1 Department of Electronics and Communication Engineering, C U Shah University, IN
2 Department of Electronics and Communication Engineering, Gokul Global University, IN
3 Department of Electronics and Communication Engineering, Atmiya University, IN

Abstract

Medical imaging greatly affects medication, particularly in the fields of diagnosis analysis and careful surgical planning. In any case, medical imaging gadgets continue delivering a great deal of data information for each patient. Medical image examination and data compression is a significant region of research which targets delivering calculations that diminish record size and simultaneously keep up important symptomatic data. Medical image compression applications are quality-driven applications which request high caliber for specific areas that have demonstrative significance for diagnosis, where even little quality decrease presented by lossy coding may modify resulting finding, which may cause serious lawful outcomes. The fundamental focal point of this paper is to investigate procedures and discover a compression algorithm that can eliminate irrelevant medical data and reconstruct medical image rapidly while keeping up a decent degree of visual quality for certain regions of medication where it is adequate to keep up high image quality just for indicatively noteworthy regions, for instance, tumor segment of the cerebrum MRI. Wavelet multi-resolution decomposition of images has indicated its proficiency in many image processing areas and explicitly in compression. Because of this, The Discrete Wavelet Transform (DWT) is used to code Region of Interest and Discrete Cosine Transformation (DCT) is utilized to code background region. A couple of examinations were led to break down the calculations dependent on compression proportion, decompressed image quality and execution speed.

Keywords

Medical Imaging, ROI, DWT, DCT, Lossy and Lossless Compression.

Full Text